Quantum compiling with diffusive sets of gates
نویسندگان
چکیده
منابع مشابه
Compiling Hume down to gates
We describe the implementation of a subset of the Hume programming language on a FPGA architecture at the gate level. Hume is a domain specific language for developping multi-process systems requiring strong static guarantees that resource bounds are met. The compiler produces RT-level, synthetizable VHDL code that can be processed by a standard tool chain to program FPGAs at the gate level. Pr...
متن کاملThe Problem of Constructing Efficient Universal Sets of Quantum Gates
The purpose of this report is threefold. First, we study the paper [Letter] in detail providing several new proofs and explanations there. Secondly we provide a new result on constructing efficient universal sets of quantum gates. Thirdly, we study two papers which give algorithms for the SolovayKitaev theorem. The paper [D-L] provides full details of parts 1 and 2 of this report. Acknowledgeme...
متن کاملImplementation of Single-Qutrit Quantum Gates via Tripod Adiabatic Passage
We proposed and analyzed implementation of the single-qutrit quantum gates based on stimulated Raman adiabatic passage (STIRAP) between magnetic sublevels in atoms coupled by pulsed laser fields. This technique requires only the control of the relative phase of the driving fields but do not involve any dynamical or geometrical phases, which make it independent of the other interaction details: ...
متن کاملTopological Quantum Gates with Quantum Dots
We present an idealized model involving interacting quantum dots that can support both the dynamical and geometrical forms of quantum computation. We show that by employing a structure similar to the one used in the Aharonov-Bohm effect we can construct a topological two-qubit phase-gate that is to a large degree independent of the exact values of the control parameters and therefore resilient ...
متن کاملEfficient quantum computation with probabilistic quantum gates.
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p. The required computational overhead scales efficiently both with 1/p and n, where n is the number of qubits in the computation. This approach provides an efficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2018
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.98.012325